On-line stream merging in a general setting

نویسندگان

  • Wun-Tat Chan
  • Tak Wah Lam
  • Hing-Fung Ting
  • Prudence W. H. Wong
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Target setting in the process of merging and restructuring of decision-making units using multiple objective linear programming

This paper presents a novel approach to achieving the goals of data envelopment analysis in the process of reconstruction and integration of decision-making units by using multiple objective linear programming. In this regard, first, we review inverse data envelopment analysis models for data reconstruction and integration. We present a model with multi-objective linear programming structure in...

متن کامل

The Dyadic Algorithm for Stream Merging

We study the stream merging problem for media-on-demand servers. Clients requesting media from the server arrive by a Poisson process, and delivery to the clients starts immediately. Clients are prepared to receive up to two streams at any time, one or both being fed into a buffer cache. A multicast mechanism exists that allows multiple clients to receive the same stream. We present an on-line ...

متن کامل

An analysis of merging effects on academic culture

Since the merging of organizations and institutions has undeniable effects on them, and appropriate action is needed in this regard. The present research selected the merging of Shahid-Abbaspour University in Shahid-Beheshti University as a case study to identify the effects of this action. This study, in terms of purpose and method, is applied and descriptive-survey, respectively.  The general...

متن کامل

Provably Efficient Stream Merging

We investigate the stream merging problem for mediaon-demand servers. Clients requesting media from the server arrive by a Poisson process, and delivery to the clients starts immediately. Clients are prepared to receive up to two streams at any time, one or both being fed into a bu er cache. A multicast mechanism exists that allows multiple clients to receive the same stream. We present an on-l...

متن کامل

The Dyadic Stream Merging Algorithm

We study the stream merging problem for media-on-demand servers. Clients requesting media from the server arrive by a Poisson process, and delivery to the clients starts immediately. Clients are prepared to receive up to two streams at any time, one or both being fed into a buffer cache. We present an on-line algorithm, the dyadic stream merging algorithm, whose recursive structure allows us to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 296  شماره 

صفحات  -

تاریخ انتشار 2003